一个安全有效的身份鉴别协议与对应的数字签名方案

本文利用二元一次不定方程和Schnorr身份鉴别协议，构造出一个新的身份鉴别协议，该协议在RSA问题和离散对数问题是难解的假设下是安全的，同时给出了所对应的数字签名方案。     

Efficient Management of Persistent Knowledge

Although computer speed has steadily increased and memory is getting cheaper, the need for storage managers to deal efficiently with applications that cannot be held into main memory is vital. Dealing with large quantities of clauses implies the use of persistent knowledge and thus, indexing methods are essential to access efficiently the subset of clauses relevant to answering a query. We introduce PerKMan, a storage manager that uses G-trees, and aims at efficient manipulation of large amounts of persistent knowledge. PerKMan may be connected to Prolog systems that offer an external C language interface. As well as the fact that the storage manager allows different arguments of a predicate to share a common index dimension in a novel manner, it indexes rules and facts in the same manner. PerKMan handles compound terms efficiently and its data structures adapt their shape to large dynamic volumes of clauses, no matter what the distribution. The storage manager achieves fast clause retrieval and reasonable use of disk space.     

RATIONALITY AND ITS ROLES IN REASONING

The economic theory of rationality promises to equal mathematical logic in its importance for the mechanization of reasoning. We survey the growing literature on how the basic notions of probability, utility, and rational choice, coupled with practical limitations on information and resources, influence the design and analysis of reasoning and representation systems.     

OPTIMUM-AIV: A planning and scheduling system for spacecraft AIV

This paper presents a project undertaken for the European Space Agency (ESA). The project is developing a knowledge based system for planning and scheduling of activities for spacecraft assembly, integration and verification (AIV). The system extends to the monitoring of plan execution and the plan repair phases.

The objectives of the contract are to develop an operational kernel of a planning, scheduling and plan repair tool, called OPTIMUM-AIV, and to provide facilities which will allow individual projects to customize the kernel to suit its specific needs. The kernel shall consist of a set of software functionalities for assistance in the initial specification of the AIV plan, in the verification and generation of valid plans and schedules for the AIV activities, and in interactive monitoring and execution problem recovery for the detailed AIV plans. Embedded in OPTIMUM-AIV are external interfaces which allow integration with alternative scheduling systems and project databases.

The current status of the OPTIMUM-AIV project, as of May 1991, is that the architectural design of the system has been agreed on by ESTEC/ESA and detailed design and implementation is now underway, expecting a final delivery in October of 1991.     

泡沫衬垫缓冲性能模型参数混合优化方法

有一类模型参数,由于取值间不明确,目标函数不属显函数,目标函数计算工作量大,采用通常优化方法很难求解。研究提出一种利用知识信息识别模型参数的混合优化方法。该方法用于识别泡沫塑料包装衬垫缓冲性能模型参数时十分有效。     

An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions

We consider noninteractive zero-knowledge proofs in the shared random string model proposed by Blum et al. [5]. Until recently there was a sizable polynomial gap between the most efficient noninteractive proofs for NP based on general complexity assumptions [11] versus those based on specific algebraic assumptions [7]. Recently, this gap was reduced to a polylogarithmic factor [17]; we further reduce the gap to a constant factor. Our proof system relies on the existence of one-way permutations (or trapdoor permutations for bounded provers). Our protocol is stated in the hidden bit model introduced by Feige et al. [11]. We show how to prove that an n -gate circuit is satisfiable, with error probability 1/n ^O(1) , using only O(n lg n) random committed bits. For this error probability, this result matches to within a constant factor the number of committed bits required by the most efficient known interactive proof systems. Received 20 November 1995 and revised 7 October 1996     

The Electronic Encapsulation of Knowledge for Groundwater Quality Management

Computers have become the main tool used in Ground Water Quality Management (GWQM). Computer software has been developed to encapsulate, process and present information on groundwater pollution problems. Continuing demands for more efficient handling of information have resulted in increasing integration of the software into Decision Support Systems (DSSs). Encapsulation and integration of both quantitative (numerical) and qualitative (knowledge) information are required to support decision-making processes. A review of current achievements in the software integration and especially in knowledge encapsulation reveals no clear developing directions (research lines) in these fields. Attention must be therefore directed to: (1) the main GWQM tasks, seen in the light of knowledge encapsulation, and (2) postulates and techniques of Artificial Intelligence (AI) related to knowledge encapsulation and DSS development. The case-specific nature of groundwater pollution problems and a lack of formalised expertise in GWQM are the main difficulties in development of knowledge-containing systems. Work on the taxonomy of GWQM tasks and related knowledge is recommended to enable broader application of AI in knowledge encapsulation, as well as in development of DSSs for GWQM as a whole.     

基于集成式知识表示的专家系统开发工具

本文针对工程应用中知识的特点，提出了一种新型的知识表示方法－集成式的知识表示，给出了这种知识表示的ＢＮＦ范式，并就如何这诸多类型的知识正确、高效地推理进行了详细读者论坛，同时给出了推理过程的算法。     

制造企业的产品创新与知识管理

分析了制造企业所面临的变革与挑战，探讨了“知识”在产品创新过程中作为一种独特而又无限的资源必须进行有效的管理和充分利用的观点，认为知识已经成为产品创新和帮助客户创造价值的源泉，传统制造企业能否向知识型制造企业过渡，在很大程度上取决于在其业务过程中是否能有效地获取和应用知识。在构建了知识型制造企业总体构架的基础上，根据知识管理的目标、构架特征和系统结构，研究了知识型企业的知识共享空间基础的建立。通过案例分析了建立知识管理系统的主要过程及其应用。